Constructing Verifiable Random Number in Finite Field

نویسندگان

  • Jun Ye
  • Xiaofeng Chen
  • Jianfeng Ma
چکیده

In information security field underlying cryptography, random sequences, which are the base of system security, play a very important role. Random sequences with high security are often needed in cryptography field. From the view of security, real random sequences should be completely unpredictable and reliable. In many circumstances, a random number not only need to be random, but also need to be verifiable. So verifiable random number is much needed in cryptography. Using linear equations in finite field, a method for constructing verifiable random number is proposed. It enjoys advantages of high efficiency and no error. Then the security properties such as unpredictability and unmanipulability are analyzed, and an example is given to show the feasibility of the method. Finally, a way for fast generation and verification of VRN with large amounts of data is given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

False shares in verifiable secret sharing with finite field commitments

Verifiable secret sharing (VSS) schemes [1–3] rely on the assumption that parties can not reliably fabricate false secret shares which pass the verification process. Here, we show that, for certain VSS implementations that use verification commitments bounded to a finite field, this assumption is incorrect. Let there be n shares of a secret and a threshold of t secret shares required to get the...

متن کامل

Constrained Pseudorandom Functions: Verifiable and Delegatable

Constrained pseudorandom functions (introduced independently by Boneh and Waters (CCS 2013), Boyle, Goldwasser, and Ivan (PKC 2014), and Kiayias, Papadopoulos, Triandopoulos, and Zacharias (CCS 2013)), are pseudorandom functions (PRFs) that allow the owner of the secret key k to compute a constrained key kf , such that anyone who possesses kf can compute the output of the PRF on any input x suc...

متن کامل

Efficient Construction of (Distributed) Verifiable Random Functions

We give the first simple and efficient construction of verifiable random functions (VRFs). VRFs, introduced by Micali et al. [MRV99], combine the properties of regular pseudorandom functions (PRFs) [GGM86] (i.e., indistinguishability from a random function) and digital signatures [GMR88] (i.e., one can provide an unforgeable proof that the VRF value is correctly computed). The efficiency of our...

متن کامل

Constructing Verifiable Random Functions with Large Input Spaces

We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior constructions required either an interactive complexity assumption or one that could tolerate a factor 2 security loss for n-bit inputs. Our construction is practical and inspired by the pseudorandom functions of Naor and Reingold...

متن کامل

Weak Verifiable Random Functions

Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commitment to all values of the function and can then produce, for any input x, a proof that the function has been evaluated correctly on x, preserving pseudorandomness for all other inputs. No public-key (even a falsely g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Internet Serv. Inf. Secur.

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2013